Additive Algorithm for Solving 0-1 Integer Linear Fractional Programming Problem
نویسندگان
چکیده
منابع مشابه
An Algorithm for Solving Bi-Level Integer Linear Fractional Programming Problem based on Fuzzy Approach
This paper presents a fuzzy approach for solving the bi-level integer linear fractional programming problem (BILFPP). At the first phase of the solution algorithm and to avoid the complexity of non convexity of this problem, we begin by finding the convex hull of its original set of constraints using the cutting-plane algorithm, and then the Charnes & Cooper transformation is used to convert th...
متن کاملAlgorithm for Solving Fuzzy Multiobjective Linear Fractional Programming Problem by Additive Weighted Method
In this paper attention has been paid to the study of multiobjective linear fractional programming problem (MOLFPP) by using fuzzy set theoretic approach. In this approach, MOLFPP is transformed into multiobjective linear programming problem (MOLPP) by suitable transformation. In algorithm-I, MOLFPP is transformed into MOLPP by using fuzzy set theory and the pareto optimal solution of the trans...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving Intuitionistic Fuzzy Linear Fractional Programming Problem
A new method is proposed to find an optimal intuitionistic fuzzy solution to fully intuitionistic fuzzy linear fractional programming (IFLFP) problem, in which ranking functions are not used. Here, the IFLFP problem is transformed into an equivalent crisp linear fractional programming problem which is then solved by linear programming (LP) technique and / or linear fractional programming techni...
متن کاملAn Algorithm for Solving the Linear Integer Programming Problem over a Finite Additive Group, with Extensions to Solving General Linear and Certain Nonlinear Integer Problems
Ralph Gomory has recently aroused interest in a special type of knapsack problem in which the constraint coefficients and constant term are elements of a finite additive group. The significance of this problem lies in the fact that it is closely related to the general integer linear programming problem, resulting by removing the nonnegativity restrictions on those variables in the general probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dhaka University Journal of Science
سال: 2013
ISSN: 2408-8528,1022-2502
DOI: 10.3329/dujs.v61i2.17066